SELF-ORGANIZING MAP WITH NGUYEN-WIDROW INITIALIZATION ALGORITHM FOR GROUNDWATER VULNERABILITY ASSESSMENT
نویسندگان
چکیده
منابع مشابه
Image Compression Using Multilayer Feed Forward Artificial Neural Network with Nguyen Widrow Weight Initialization Method
In this paper, Multilayer Feed Forward Artificial Neural Network with weight initialization method is Proposed for Image Compression. Image compression helps to reduce the storage space and transmission cost. Artificial Neural network (ANNs) is a training algorithm has used to compress the image. Artificial neural network is exceptionally Feed Forward Back propagation neural network (FFBPNN) in...
متن کاملThe Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملImproving Self-Organizing Feature Map (SOFM) Training Algorithm Using K-Means Initialization
Self-Organizing Feature map (SOFM) is a competitive neural network in which neurons are organized in an l-dimensional lattice (grid) representing the feature space. The principal goal of the SOFM is to transform an incoming pattern of arbitrary dimension into a oneor twodimensional discrete map, and to perform this transformation adaptively in a topologically ordered fashion. Usually, SOFM can ...
متن کاملImproving the Self-Organizing Feature Map Algorithm Using an Efficient Initialization Scheme
It is often reported in the technique literature that the success of the self-organizing feature map formation is critically dependent on the initial weights and the selection of main parameters (i.e. the learning-rate parameter and the neighborhood set) of the algorithm. They usually have to be counteracted by the trial-and-error method; therefore, often time consuming retraining procedures ha...
متن کاملFast self-organizing feature map algorithm
We present an efficient approach to forming feature maps. The method involves three stages. In the first stage, we use the K-means algorithm to select N2 (i.e., the size of the feature map to be formed) cluster centers from a data set. Then a heuristic assignment strategy is employed to organize the N2 selected data points into an N x N neural array so as to form an initial feature map. If the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computing
سال: 2020
ISSN: 2312-5381,1727-6209
DOI: 10.47839/ijc.19.1.1694